Hierarchical filtered motion field for action recognition

ABSTRACT

Described is a hierarchical filtered motion field technology such as for use in recognizing actions in videos with crowded backgrounds. Interest points are detected, e.g., as 2D Harris corners with recent motion, e.g. locations with high intensities in a motion history image (MHI). A global spatial motion smoothing filter is applied to the gradients of MHI to eliminate low intensity corners that are likely isolated, unreliable or noisy motions. At each remaining interest point, a local motion field filter is applied to the smoothed gradients by computing a structure proximity between sets of pixels in the local region and the interest point. The motion at a pixel/pixel set is enhanced or weakened based on its structure proximity with the interest point (nearer pixels are enhanced).

BACKGROUND

Automated recognition of human actions in video clips has many useful applications, including surveillance, health care, human computer interaction, computer games, and telepresence. In general, a trained action model (classifier) processes the video clips to determine whether a particular action takes place.

One typical situation is that action models are trained on video data with a clean background, such as by a single person performing the action of interest with little or no movement in the background. Once trained and used for classifying actual video, accurate action recognition is difficult when the video clip being processed has a cluttered and moving background, that is, when the motion field in an action region is contaminated by background motions. This is common in actual video clips, and thus it is desirable to more accurately recognize human actions in dynamic and/or crowded environments, while still being able to use action models trained on video data with a clean background.

SUMMARY

This Summary is provided to introduce a selection of representative concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used in any way that would limit the scope of the claimed subject matter.

Briefly, various aspects of the subject matter described herein are directed towards a technology by which video data containing motion information is filtered into interest points from which associated motion features are determined. The interest points may be represented as feature descriptors that contain spatial information for the spatial characteristics of a region corresponding to the interest point and temporal information for the motion data of the region.

In one aspect, possible points of interest corresponding to action data and background data within video data are obtained, e.g., corners obtained by a Harris corner component. These possible points of interest are associated with motion information, such as by a motion history image that represents more recent motion by more intensity in the image. Gradients of the motion history image may be obtained, and smoothing performed to remove points that are likely static background points by a global filter that filters out low-intensity points (relative to a threshold).

In one aspect, the remaining set of interest points are further processed by a local motion filter. In general, sets of pixels in a region (neighborhood) corresponding to an interest point have associated motion data varied based upon each set's proximity to the interest point, such as measured by distance from the closest pixel in the set to the interest point. Those sets of pixels that are close to the interest point have their motion data enhanced, while those sets of pixel that are far from the interest point have their motion data reduced.

In one aspect, feature descriptors are generated for the regions. The feature descriptors include spatial (e.g., appearance) information, such as in a Histogram of Oriented Gradient (HOG) component comprising normalized histograms of patches corresponding to the region. The feature descriptors also may include a HOG-MHI that represents the motion features in a motion history image (MHI).

Other advantages may become apparent from the following detailed description when taken in conjunction with the drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example and not limited in the accompanying figures in which like reference numerals indicate similar elements and in which:

FIG. 1 is a representation of a framework for filtering detected interest points in a video clip for generating feature descriptors including motion information.

FIG. 2 is a representation of binary images of the smoothed gradients quantized into one of eight bins based on direction.

FIG. 3 is a representation of direction quantization for maintaining motion information including direction information in a HOG-MHI component of a feature descriptor.

FIG. 4 is a representation of quantization for maintaining spatial information in HOG component of a feature descriptor.

FIGS. 5 and 6 comprise representations of sets (blobs) of pixels with associated motion data that is enhanced or reduced by local motion filtering based upon proximity of the pixel sets to an interest point.

FIG. 7 shows an illustrative example of a computing environment into which various aspects of the present invention may be incorporated.

DETAILED DESCRIPTION

Various aspects of the technology described herein are generally directed towards obtaining stable and generalized features from video, including by using feature descriptors that are able to characterize actions but are more insensitive to cluttered background motion. To this end, there is provided an efficient hierarchical filtering technique to extract motion information and reduce the motions caused by moving background objects.

In one aspect, interest points and a Motion History Image (MHI) that provides representations of motion are extracted from video. A global spatial motion smoothing filter is applied to the gradients of the (MHI). At each interest point, a local motion field filter is applied to the smoothed gradients of MHI by computing a structure proximity between a pixel in a local region and the interest point. The motion at a pixel is varied (enhanced or weakened) based on its structure proximity with the interest point.

It should be understood that any of the examples herein are non-limiting. As such, the present invention is not limited to any particular embodiments, aspects, concepts, structures, functionalities or examples described herein. Rather, any of the embodiments, aspects, concepts, structures, functionalities or examples described herein are non-limiting, and the present invention may be used in various ways that provide benefits and advantages in computing and video processing in general.

FIG. 1 is a block diagram showing a framework for action recognition that provides benefits in videos with crowded, dynamic backgrounds. As will be understood, instead of using spatio-temporal invariant points, spatial and temporal information is separately extracted from the video by an interest point detection component 104 of the framework.

In one implementation, the spatial information is extracted as 2D Harris corners (block 106 in FIG. 1) in an original image. The temporal information is obtained from Motion History Image (MHI, a known mechanism represented by block 108), which is based on frame differencing over a plurality of frames (and allows avoiding unreliable keypoint tracking in crowded videos). The pixels in the MHI have intensities that indicate movement, with brighter intensities representing the moving objects with more recent motion. These pixels are formed as a motion template. As described below, the motion template and the extracted 2D Harris corners are combined for interest point detection, and only those corners with the most recent motion are selected as interest points.

More particularly, MHI comprises a real-time motion template that temporally layers consecutive image differences into a static image template. Pixel intensity is a function of the motion history at that location, where brighter values correspond to more recent motion. The directional motion information may be measured directly from the intensity gradients in the MHI, which are more efficient to compute than optical flow, and are also more robust because the motion information in MHI is mainly along the contours of the moving objects. Thus, unwanted motion in the interior regions of object contours is ignored.

To generate a MHI, a known replacement and decay operator is used. At location (x, y) and time t, the intensity of MHI_(τ)(x, y, t) is calculated:

$\begin{matrix} {{{MHI}_{\tau}\left( {x,y,t} \right)} = \left\{ \begin{matrix} {\tau,} & {{{if}\mspace{14mu} {D\left( {x,y,t} \right)}} = 1} \\ {{\max \left( {0,{{{MHI}_{\tau}\left( {x,y,t} \right)} - 1}} \right)},} & {otherwise} \end{matrix} \right.} & (1) \end{matrix}$

where D(x, y, t) is a binary image of differences between frames and τ is the maximum duration of motion, which is set to twenty (20) in one implementation. In one implementation, the MHI image is then scaled to a grayscale image with maximum intensity 255 for pixels with the most recent motion.

Interest point detection is based on detecting corners in images (2D Harris Corner Detection, which is well known) and combining the corners with the temporal information that is obtained from MHI. Note that Harris Corner detection is stable to different scales and insensitive to lighting changes. MHI is used as a motion mask to remove those corners that are in the static background, such that only the corners with more recent motion (the intensity in MHI is greater than a threshold value) are selected as interest points.

Returning to FIG. 1, another component of the framework comprises a hierarchical motion filter component 110. More particularly, an isolated motion direction of a pixel compared to its neighbor pixels often is a distracting motion, or noise. To remove such isolated distracting motions, after the global spatial motion smoothing filter 112 is applied to the gradients of MHI, at each interest point, a local motion field filter 114 is applied. As described herein, this local filtering operates by computing a structure proximity between any pixel in the local region and the interest point. Thus, the motion at a pixel is enhanced or weakened based on its structure proximity with the interest point. Additional details of filtering are described below.

With reference to the feature descriptors 120, in one implementation the spatial features 122 are modeled by Histograms of Oriented Gradient (HOG) in the intensity image. Other features may be alternatively used, e.g., the well known SIFT or STIP features. To characterize the temporal features 124, in one implementation a temporal feature descriptor is provided as described herein, referred to as Histograms of Oriented Gradient in Motion History Image (HOG-MHI). The feature vectors (descriptors 120), which contain both the HOG sub-vector (spatial features 122) or other features and the HOG-MHI sub-vector (temporal features 124), may be modeled by a Gaussian Mixture Model (GMM) based-classifier 130 for recognition of actions 132.

The hierarchical filtered motion field technique is thus based on Motion Gradient Image (MGI). The MGI comprises the intensity gradients of MHI, which directly yield the motion orientation; (note that the magnitudes of the MHI gradients are not meaningful). Although high-level information may be needed to distinguish the action motions from the background motions, noisy motions may be reduced, and the action motions enhanced by hierarchical filtered motion field for action motion enhancement. This is generally because an isolated motion direction of a pixel compared to its neighbor pixels is often a distracting motion or a noisy motion, and at each interest point, the motion regions which are closer to the interest point contribute more to the object to which the interest point belongs.

In global filtering, a motion smoothing step is applied at the MGI to remove the isolated motion directions by morphological operations to obtain a global filtered motion field comprising smoothed gradients of MHI that remove the isolated distracting motions. To prepare for local filtered motion field processing, the smoothed gradients of MHI are decomposed as a number of layers with different motion directions. FIG. 2 illustrates an 8-bin-layer representation 222 of a binary image of the smoothed gradients of MHI; the arrows show the direction corresponding to each bin, as also represented in FIG. 3. As shown in FIG. 3, a total 8 bin HOG-MHI motion directions are used in one implementation, falling in the range of n±22.5° (n=1, 2, . . . 8).

With respect to the local filtered motion field, at each interest point, the local filtered motion field is applied by computing structure proximity between the pixels in the local region and the interest point on each bin-layer of the smoothed gradients of MHI. In general, the local region comprises the window for calculating HOG-MHI. A connect component operation is performed to obtain motion blobs (sets of points/pixels).

FIG. 5 illustrates the blobs of bin-layer 3, in which the motion blobs with shorter distances to the interest point in the local region are more likely to represent the motion of the object to which the interest point p₀ belongs. Thus the motions at these blobs (the blobs inside the dashed ellipse) may be enhanced. Conversely, the blobs with longer distances to the interest point most likely belong to other objects (blobs outside the dashed ellipse), and thus the motions at those blobs may be weakened.

Let p₀ denote the interest point, and let B denote a blob. Denote d(p₀B) to be the minimum distance between p₀ and all the points in B, that is,

${d\left( {p_{0},B} \right)} = {\min\limits_{p \in B}{{d\left( {p_{0},p} \right)}.}}$

Note that instead of a minimum, another distance value may be used to represent proximity of the set to the interest point, e.g., center of mass of the blob, an average distance of some number of sampled pixels, and so on.

Denote (W_(x), W_(y)) to be the size of the window containing the blobs. Then the maximum distance between p₀ and any point in the window is √{square root over (W_(x) ²+W_(y) ²)}/2. For any pixel pεB, its structure proximity to interest point p₀ is defined as:

$\begin{matrix} {{s(p)} = {1 - \frac{2{d\left( {p_{0},B} \right)}}{\sqrt{W_{x}^{2} + W_{y}^{2}}}}} & (2) \end{matrix}$

Note that s(p) is a value between zero (0) and one (1). If a pixel does not belong to any blobs, its structure proximity is defined to be 0.

FIG. 6 shows a plot of the structure proximity map where the shorter the arrow to a blob, the larger the structure proximity values. The structure proximity values are used to normalize motion histograms in the HOG-MHI calculation.

The local appearance and motion features are characterized by grids of Histograms of Oriented Gradient (HOG) in the neighborhood with a window size (W_(x), W_(y)) at each interest point in the intensity image and MHI respectively. The window is further subdivided into a (n_(x), n_(y)) grid of patches (e.g., a 3 by 3 grid). Normalized histograms of the patches are concatenated into HOG (for appearance features in the intensity image) and HOG-MHI (for motion features in the MHI) descriptor vectors as the input of the classifier for action recognition.

As shown in FIGS. 3 and 4, the calculations of HOG and HOG-MHI are different. HOG is computed without considering the directions to make it more robust to appearance changes; although FIG. 4 shows four bins for HOG quantization, other implementations may have a different number of bins, such as three bins. However, for HOG-MHI computation, because directions are important to describe motion features, the performance of action recognition is increased by considering directions, and thus in one implementation, eight directional bins are provided for HOG-MHI quantization.

To handle scale variations, instead of performing a multi-scale process at each interest point, randomly selected window sizes (e.g., between 24 and 48) may be used. The size of each window is calculated by W_(x)=kn_(x) and W_(y)=kn_(y), where k is randomly chosen to make sure the values of W_(x), W_(y) are between W_(min) (minimum window size) and W_(max) (maximum window size), which in one implementation is W_(min)=24 and W_(max)=48. Using randomly selected window sizes handles scale variations well and achieves improved results relative to using fixed set of scales. To normalize the histograms of MGI, the structure proximity values are used instead of the magnitudes at each patch (as magnitudes are not meaningful in this context).

To characterize the complex nature of rich descriptors, a Gaussian Mixture Model (GMM) 130 is used, which is known to have the ability to model any given probability distribution function when the number of mixture components is large. Given a K component GMM, the probability of a patch x is

$\begin{matrix} {{\Pr \left( x \middle| \Omega \right)} = {\sum\limits_{k = 1}^{K}{w_{k}{N\left( {{x;\mu_{k}},\Sigma_{k}} \right)}}}} & (3) \end{matrix}$

where N(x,μ_(k),Σ_(k)) denotes the normal distribution with mean μ_(k) and variance Σ_(k). The mixture weight w_(k) satisfies the constraint Σ_(k=1) ^(K)w_(k)=1. The set of parameters of GMM model is denoted as:

Ω,Ω={w_(k),μ_(k),Σ_(k)}, 1≦k≦K

Although the general mode in equation (3) supports full covariance matrices, in practice a diagonal covariance matrix is sufficient for most tasks. Furthermore, diagonal matrix GMMs are more computational efficient and robust compared with full matrix GMM. The advantages of using a GMM are that it is computationally inexpensive, and it is based on a well-understood statistical model. GMM, allows clearly estimating the probability that each patch belongs to the background or to the action of interest, which can be used to distinguish patches of actions of different categories and the background.

Consider C categories of actions with the parameter of Ω¹, Ω², . . . , Ω^(C). Each category corresponds to a GMM with K components Ω^(C)={w_(k) ^(C), μ_(k) ^(C), Σ_(k) ^(C)}. The parameters can be estimated using maximum likelihood estimation. For example, for the cth category, the process collects the patches X^(c) associated with an action c, and then estimates Ω^(c) via the maximum estimation of:

${\max\limits_{\Omega^{c}}L^{c}} = {\max\limits_{\Omega^{c}}{\sum\limits_{x_{i} \in X^{c}}{\log \; {\Pr \left( x_{i} \middle| \Omega^{c} \right)}}}}$

A straightforward way to train these models is to train Ω¹, Ω², . . . , Ω^(C) separately, however it is more effective to obtain Ω¹, Ω², . . . , Ω^(C) coherently by the use of a universal background model. An action-independent background model Ω⁰ is first trained based on the patch features xεX^(all). Then Ω¹, Ω², . . . , Ω^(C) are adapted from Ω⁰ by changing {μ_(k) ^(c)} as:

$\begin{matrix} {{p_{ik}^{c} = {{\frac{w_{k}{N\left( {{x_{i};\mu_{k}^{0}},\Sigma_{k}^{0}} \right)}}{\sum\limits_{k^{\prime} = 1}^{K}{w_{k^{\prime}}{N\left( {{x_{i};\mu_{k^{\prime}}^{0}},\Sigma_{k^{\prime}}^{0}} \right)}}}\mspace{14mu} {for}\mspace{14mu} x_{i}} \in X^{c}}}{\mu_{k}^{c} = {\frac{1}{n^{c}}{\sum\limits_{x_{i} \in X^{c}}{p_{ik}^{c}x_{i}}}}}} & (4) \end{matrix}$

Note that it is feasible to update w_(k) ^(c), and Σ_(k) ^(c), as well, however, they may remain the same as the background model. Compared with the approach which trains action model separately, the use of a background model is more computational efficient and leads to a good alignment of different action models over different components, which makes the recognition more accurate.

After obtaining the GMM parameters Ω¹, Ω², . . . , Ω^(C), an unknown video clip may be classified according to the action category. If V denotes the collection of patch descriptors in a video clip, the action may be estimated by:

$\begin{matrix} {c^{*} = {\underset{c}{argmax}{\sum\limits_{x \in V}{\log \; {\Pr \left( x \middle| \Omega^{c} \right)}}}}} & (5) \end{matrix}$

Exemplary Operating Environment

FIG. 7 illustrates an example of a suitable computing and networking environment 700 on which the examples of FIGS. 1-6 may be implemented. The computing system environment 700 is only one example of a suitable computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the invention. Neither should the computing environment 700 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary operating environment 700.

The invention is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well-known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to: personal computers, server computers, hand-held or laptop devices, tablet devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.

The invention may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, and so forth, which perform particular tasks or implement particular abstract data types. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in local and/or remote computer storage media including memory storage devices.

With reference to FIG. 7, an exemplary system for implementing various aspects of the invention may include a general purpose computing device in the form of a computer 710. Components of the computer 710 may include, but are not limited to, a processing unit 720, a system memory 730, and a system bus 721 that couples various system components including the system memory to the processing unit 720. The system bus 721 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus also known as Mezzanine bus.

The computer 710 typically includes a variety of computer-readable media. Computer-readable media can be any available media that can be accessed by the computer 710 and includes both volatile and nonvolatile media, and removable and non-removable media. By way of example, and not limitation, computer-readable media may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer-readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by the computer 710. Communication media typically embodies computer-readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media. Combinations of the any of the above may also be included within the scope of computer-readable media.

The system memory 730 includes computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) 731 and random access memory (RAM) 732. A basic input/output system 733 (BIOS), containing the basic routines that help to transfer information between elements within computer 710, such as during start-up, is typically stored in ROM 731. RAM 732 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 720. By way of example, and not limitation, FIG. 7 illustrates operating system 734, application programs 735, other program modules 736 and program data 737.

The computer 710 may also include other removable/non-removable, volatile/nonvolatile computer storage media. By way of example only, FIG. 7 illustrates a hard disk drive 741 that reads from or writes to non-removable, nonvolatile magnetic media, a magnetic disk drive 751 that reads from or writes to a removable, nonvolatile magnetic disk 752, and an optical disk drive 755 that reads from or writes to a removable, nonvolatile optical disk 756 such as a CD ROM or other optical media. Other removable/non-removable, volatile/nonvolatile computer storage media that can be used in the exemplary operating environment include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM, and the like. The hard disk drive 741 is typically connected to the system bus 721 through a non-removable memory interface such as interface 740, and magnetic disk drive 751 and optical disk drive 755 are typically connected to the system bus 721 by a removable memory interface, such as interface 750.

The drives and their associated computer storage media, described above and illustrated in FIG. 7, provide storage of computer-readable instructions, data structures, program modules and other data for the computer 710. In FIG. 7, for example, hard disk drive 741 is illustrated as storing operating system 744, application programs 745, other program modules 746 and program data 747. Note that these components can either be the same as or different from operating system 734, application programs 735, other program modules 736, and program data 737. Operating system 744, application programs 745, other program modules 746, and program data 747 are given different numbers herein to illustrate that, at a minimum, they are different copies. A user may enter commands and information into the computer 710 through input devices such as a tablet, or electronic digitizer, 764, a microphone 763, a keyboard 762 and pointing device 761, commonly referred to as mouse, trackball or touch pad. Other input devices not shown in FIG. 7 may include a joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 720 through a user input interface 760 that is coupled to the system bus, but may be connected by other interface and bus structures, such as a parallel port, game port or a universal serial bus (USB). A monitor 791 or other type of display device is also connected to the system bus 721 via an interface, such as a video interface 790. The monitor 791 may also be integrated with a touch-screen panel or the like. Note that the monitor and/or touch screen panel can be physically coupled to a housing in which the computing device 710 is incorporated, such as in a tablet-type personal computer. In addition, computers such as the computing device 710 may also include other peripheral output devices such as speakers 795 and printer 796, which may be connected through an output peripheral interface 794 or the like.

The computer 710 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 780. The remote computer 780 may be a personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computer 710, although only a memory storage device 781 has been illustrated in FIG. 7. The logical connections depicted in FIG. 7 include one or more local area networks (LAN) 771 and one or more wide area networks (WAN) 773, but may also include other networks. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.

When used in a LAN networking environment, the computer 710 is connected to the LAN 771 through a network interface or adapter 770. When used in a WAN networking environment, the computer 710 typically includes a modem 772 or other means for establishing communications over the WAN 773, such as the Internet. The modem 772, which may be internal or external, may be connected to the system bus 721 via the user input interface 760 or other appropriate mechanism. A wireless networking component such as comprising an interface and antenna may be coupled through a suitable device such as an access point or peer computer to a WAN or LAN. In a networked environment, program modules depicted relative to the computer 710, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation, FIG. 7 illustrates remote application programs 785 as residing on memory device 781. It may be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.

An auxiliary subsystem 799 (e.g., for auxiliary display of content) may be connected via the user interface 760 to allow data such as program content, system status and event notifications to be provided to the user, even if the main portions of the computer system are in a low power state. The auxiliary subsystem 799 may be connected to the modem 772 and/or network interface 770 to allow communication between these systems while the main processing unit 720 is in a low power state.

CONCLUSION

While the invention is susceptible to various modifications and alternative constructions, certain illustrated embodiments thereof are shown in the drawings and have been described above in detail. It should be understood, however, that there is no intention to limit the invention to the specific forms disclosed, but on the contrary, the intention is to cover all modifications, alternative constructions, and equivalents falling within the spirit and scope of the invention. 

1. In a computing environment, a method performed on at least one processor comprising: obtaining possible points of interest corresponding to action data and background data within video data, the possible points of interest comprising spatial data and temporal data; performing global filtering based on the temporal data to remove at least some of the possible points of interest that likely represent background data, to provide a set of interest points; and performing local filtering on at least some of the interest points of the set, including for each interest point, determining a local region relative to the interest point, in which one or more sets of pixels are associated with motion data, and for each set of pixels, obtaining proximity data upon a distance value from that set to the interest point, and varying the motion data based upon the proximity data.
 2. The method of claim 1 wherein obtaining the possible points of interest comprises detecting Harris corners in a frame of video.
 3. The method of claim 2 wherein obtaining the possible points of interest comprises obtaining a motion history image based upon the frame of video and at least one other frame.
 4. The method of claim 3 wherein performing global filtering comprises smoothing intensity gradients of the motion history image, including removing possible interest points that have an intensity value below a threshold.
 5. The method of claim 1 wherein varying the motion data based upon the proximity data comprises enhancing motion data for sets of pixels having proximity data indicative of a short distance to the interest point, or weakening motion data for sets of pixels having proximity data indicative of a long distance to the interest point, or both enhancing motion data for sets of pixels having proximity data indicative of a short distance to the interest point and weakening motion data for sets of pixels having proximity data indicative of a long distance to the interest point.
 6. The method of claim 1 further comprising, representing a region corresponding to each interest point of the set of interest points with a descriptor having a spatial component and a temporal component.
 7. The method of claim 1 further comprising, representing each interest point of the set of interest points with histogram of gradient component that represents spatial information and a histogram of gradient-motion history image component that represents temporal information.
 8. The method of claim 1 further comprising, representing a region corresponding to each interest point of the set of interest points with a descriptor having a spatial component and a temporal component, and modeling the descriptor to detect action.
 9. The method of claim 1 further comprising, obtaining the sets of pixels by segmenting a neighbor region.
 10. In a computing environment, a system comprising, an interest point detection component that detects possible points of interest in video data, a hierarchical motion filter that processes the possible points of interest into a set of interest points corresponding to motion in video data, from which feature descriptors representing regions corresponding to those interest points are generated, each feature descriptor including a spatial component and a temporal component.
 11. The system of claim 10 wherein the interest point detection component comprises a corner detector that detects the possible points of interest and a component that represents each possible point of interest as an intensity corresponding to any recent motion associated with that point.
 12. The system of claim 11 wherein the hierarchical motion filter includes a global filter that processes gradients of the motion history image to filter out possible points of interest based on whether each point of interest in the gradients has an associated intensity above a threshold.
 13. The system of claim 11 wherein the hierarchical motion filter includes a local motion filter that for each interest point varies motion data of one or more sets of neighboring pixels based upon proximity to the interest point.
 14. The system of claim 13 wherein the proximity to the interest point is determined by one pixel within the set of pixels that has a minimum distance to the interest point.
 15. The system of claim 10 wherein each feature descriptor includes a spatial component and a temporal component.
 16. The system of claim 10 wherein each feature descriptor includes a histogram of gradient-motion history image component that represents temporal information, including associated direction information.
 17. The system of claim 10 further comprising, an action classifier modeled from the feature descriptors.
 18. The system of claim 17 wherein the action classifier comprises a Gaussian Mixture Model.
 19. One or more computer-readable media having computer-executable instructions, which when executed perform steps, comprising: detecting corners in video data; detecting motion information associated with the corners and representing the motion information as a motion history image; obtaining gradients of the motion history image; smoothing the gradients of the motion history image by removing corners having data corresponding to the associated motion below a threshold to obtain interest points; and for each interest point: performing local filtering to vary motion data of one or more sets of pixels neighboring the interest point based on proximity of each set of pixels to the interest point, and generating a feature descriptor that includes spatial information representative of spatial characteristics and temporal information representative of motion of a region corresponding to the interest point.
 20. The one or more computer-readable media of claim 19 having further computer-executable instructions comprising modeling a Gaussian Mixture Model-based classifier from the feature descriptors. 